global least squares solution of matrix equation $sum_{j=1}^s a_jx_jb_j = e$

نویسندگان

saeed karimi

چکیده

in this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s a_jx_jb_j = e$. this method is based on the global least squares (gl-lsqr) method for solving the linear system of equations with the multiple right hand sides. for applying the gl-lsqr algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are de ned. it is proved that the new iterative method obtains the least norm solution of the mentioned matrix equation within finite iteration steps in the exact arithmetic, when the above matrix equation is consistent. moreover, the optimal approximate solution $(x_1^* ,x_2^* ,ldots,x_s^*)$ to a given multiple matrices $( bar{x}_1, bar{x}_2,ldots,bar{x}_s)$ can be derived by nding the least norm solution of a new matrix equation. finally, some numerical experiments are given to illustrate the eciency of the new method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$

In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...

متن کامل

GLOBAL TOTAL LEAST SQUARES Global Total Least Squares

A method for the construction of open approximate models from vector time series Preface PhD research is a largely open proces in which a stimulating environment plays a crucial role. I am indebted to several people and institutions that shaped such an environment for me during the years since April 1990. First and for all, I would like to thank my supervisor, Christiaan Heij. He set me on the ...

متن کامل

The least-square bisymmetric solution to a quaternion matrix equation with applications

In this paper, we derive the necessary and sufficient conditions for the quaternion matrix equation XA=B to have the least-square bisymmetric solution and give the expression of such solution when the solvability conditions are met. Futhermore, we consider the maximal and minimal inertias of the least-square bisymmetric solution to this equation. As applications, we derive sufficient and necess...

متن کامل

Least-Squares Covariance Matrix Adjustment

We consider the problem of finding the smallest adjustment to a given symmetric n × n matrix, as measured by the Euclidean or Frobenius norm, so that it satisfies some given linear equalities and inequalities, and in addition is positive semidefinite. This least-squares covariance adjustment problem is a convex optimization problem, and can be efficiently solved using standard methods when the ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of mathematical modeling

جلد ۲، شماره ۲، صفحات ۱۷۰-۱۸۶

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023